Maximum Service Coverage in Business Site Selection Using Computer Geometry Software

A planar maximum coverage location problem in a continuous formulation is considered. The demand zone and service areas are presented as geometric items of given shapes sizes. Each area associated with point (centroid), relative to which the corresponding item forms. task find position centroids provide an optimal for according criterion. mathematical model constructed nonlinear optimization problem, variables coordinates centroids, objective function defined covered by services. For formalization calculation function, both analytical expressions computer geometry software used. methodology we propose applicable arbitrary areas. Moreover, this technique does not depend on complexity items, since it uses Shapely library, operates same Polygon class. An approach solving based consistent application local global methods proposed. auxiliary posed that allows one significantly reduce run time at stage optimization. implementation illustrated examples when polygon have shape circle ellipse. innovation paper lies fact business site selection studied such way shape.